/* R. J. Cano, Jan 14 2014 */

/* ...In the sense of the Algebra for Polynomials */
polynomial_in_x(v)=sum(k=1,#v,v[k]*x^(#v-k));

/* ...In the sense of the Algebra for Matrices */
operator_x_minus_one(n)=matrix(n,n,y,x,y>x);
apparent_division_by_x_minus_one(v)=(operator_x_minus_one(#v)*v);

/* Alternative sequencer */
q(n)=vectorv(n,k,prime(k));
a(n)={my(Q=q(n), P=polynomial_in_x(apparent_division_by_x_minus_one(Q))*(x-1), S=polynomial_in_x(Q)); S-P-n };

/* For example, to sequence the first 1000 terms (yeap. Unfortunately, it is slow)*/
for(k=1,1000,print(k," ",a(k)));

quit();

/*
 *
 
   The first 1000 terms of the b-file at OEIS for A101301 and
   the output for this examples match the checksum (MD5):
   
   6bc6a54ad55fe717ad414dcbbb6bd43d 
   
 * 
 */